On generalised minimal domination parameters for paths

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parameters of independence and domination by monochromatic paths in graphs

In this paper we generalize parameters of independence and domination for graphs. The behavior of parameters for independence and domination by monochromatic paths is studied when an edge or a vertex is deleted. Then we give main results concerning μ-feasible sequences and interpolation.

متن کامل

On minimal geodetic domination in graphs

Let G be a connected graph. For two vertices u and v in G, a u–v geodesic is any shortest path joining u and v. The closed geodetic interval IG[u, v] consists of all vertices of G lying on any u–v geodesic. For S ⊆ V (G), S is a geodetic set in G if ⋃ u,v∈S IG[u, v] = V (G). Vertices u and v of G are neighbors if u and v are adjacent. The closed neighborhood NG[v] of vertex v consists of v and ...

متن کامل

Generalised Domination and Independence in Graphs

In this paper, we introduce a new scheme of parameters which generalises many wellknown parameters, including the domination number, the total domination number, the independence number, and the vertex covering number.

متن کامل

A generalised upper bound for the k-tuple domination number

In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any graph G, ×k(G) ln( − k + 2)+ ln(∑k−1 m=1(k −m)d̂m + )+ 1 − k + 2 n, where ×k(G) is the k-tuple domination number; is the minimal degree; d̂m is the m-degree of G; = 1 if k = 1 or 2 and =−d if k 3; d is the average degree...

متن کامل

On generalised t-designs and their parameters

Recently, P.J. Cameron studied a class of block designs which generalises the classes of t-designs, α-resolved 2-designs, orthogonal arrays, and other classes of combinatorial designs. In fact, Cameron’s generalisation of t-designs (when there are no repeated blocks) is a special case of the “poset t-designs” in product association schemes studied ten years earlier by W.J. Martin, who further s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1990

ISSN: 0012-365X

DOI: 10.1016/0012-365x(90)90352-i